queri portal dynam gener portal entiti dorient web queri keyword framework improv keyword search entiti databas keyword search entiti databas product movi databas import problem current techniqu keyword search databas return incomplet imprecis result hand requir relev entiti queri keyword relev entiti queri keyword occur document collect requir satisfi number user queri result queri incomplet highli relev entiti return hand return entiti queri keyword intent keyword queri entiti result imprecis remedi problem paper propos gener framework improv exist search interfac translat keyword queri structur queri specif leverag keyword attribut associ discov result return origin search interfac show empir translat structur queri allevi problem exploit web search gener synonym entiti exploit web search engin search structur databas detect gene cluster evolutionari constraint larg number genom top ddown mine frequent close pattern high dimension data promot analysi multi ddimension space promot kei ingredi market desir find merit object product person organ servic promot commun paper propos function call promot analysi rank promot object leverag highli rank result object highli rank global space goal discov promot subspac object promin achiev goal notion promot formul show function practic wide varieti applic busi intellig comput promot subspac challeng due explos search space high aggreg cost effici comput propos promorank framework develop effici optim techniqu subspac prune object prune promot cube seamlessli integr framework empir evalu real data set confirm effect promot analysi propos algorithm significantli outperform baselin solut mine document collect facilit accur approxim entiti match entiti extract techniqu leverag larg refer entiti tabl identifi entiti document entiti referenc document collect differ refer entiti tabl studi problem determin substr approxim match refer entiti similar measur exploit correl candid substr refer entiti larg number document robust tradit stand string base similar function approach signific effici challeng paper adopt architectur propos techniqu address effici challeng mine document collect expand refer entiti tabl variat entiti problem approxim match input string refer entiti reduc exact match expand refer tabl implement effici extens experiment evalu demonstr accuraci scalabl techniqu mine document collect facilit accur approxim entiti match entiti extract techniqu leverag larg refer entiti tabl identifi entiti document entiti referenc document collect differ refer entiti tabl studi problem determin substr approxim match refer entiti similar measur exploit correl candid substr refer entiti larg number document robust tradit stand string base similar function approach signific effici challeng paper adopt architectur propos techniqu address effici challeng mine document collect expand refer entiti tabl variat entiti problem approxim match input string refer entiti reduc exact match expand refer tabl implement effici extens experiment evalu demonstr accuraci scalabl techniqu dcube answer prefer queri multi ddimension space applic involv decis make onlin olap style prefer analysi multidimension boolean select typic prefer queri includ top queri skylin queri analyt queri set boolean predic constrain target subset data vari increment drill roll oper effici support prefer queri multipl boolean predic boolean thenprefer prefer boolean approach satisfactori integr boolean prune prefer prune unifi framework propos signatur materi measur multi dimension group by base propos cube data cube prefer queri studi complet life cycl includ signatur gener compress decomposit increment mainten usag effici line analyt queri process present signatur base progress algorithm simultan push boolean prefer constraint deep databas search perform studi show propos method achiev order magnitud speed exist approach arcub support rank aggreg queri partial materi data cube support rank queri databas system popular research topic recent lack studi support rank queri data warehous rank multidimension aggreg measur base fact address problem propos queri execut model answer type rank aggreg queri base unifi partial cube structur arcub queri execut model candid gener verif framework promis candid cell gener set high level guid cell identifi bound principl effect prune guid cell prune children candid cell prune address problem effici onlin candid aggreg verif develop chunk base execut model verifi bulk candid bound memori buffer extens perform studi show framework lead order magnitud perform improv state art method flexibl term type rank aggreg queri support effici filter approxim membership check effici identifi max dgap cluster pairwis genom comparison integr olap rank rank dcube methodolog progress select merg comput top dk ad dhoc rank function famili threshold algorithm ta wide studi effici comput top queri ta sort merg framework assum data list pre sort rank function monoton databas applic attribut valu index treestructur indic tree tree rank function necessarili monoton answer top queri ad hoc rank function paper studi index merg paradigm perform progress search space joint state compos multipl index node address challeng effici queri process minim search complex present doubleheap algorithm support progress state search progress state gener avoid unnecessari disk access character type empti state contribut final result propos materi model join signatur prune empti state perform studi show propos method achiev order magnitud speed baselin solut datascop view databas content googl map compress frequent pattern major challeng frequent pattern mine sheer size mine result compress frequent pattern propos cluster frequent pattern tight measur call cluster select repres pattern cluster problem find minimum set repres pattern shown np hard develop greedi method rpglobal rplocal guarante compress bound higher comput complex sacrific theoret bound effici perform studi show compress qualiti rplocal close rpglobal reduc number close frequent pattern order magnitud rplocal mine faster fpclose fast close frequent pattern mine method show rpglobal rplocal combin balanc qualiti effici frequent pattern mine current statu futur direct comput iceberg cube top ddown bottom dup integr starcub approach optim bound tempor flexibl plan dynam control semant annot frequent pattern frequent pattern analyz data fundament approach data mine applic research frequent pattern mine focus develop effici algorithm discov kind frequent pattern attent paid import step interpret discov frequent pattern compress summar frequent pattern studi recent work propos techniqu annot frequent pattern nonsemant inform support limit user understand pattern articl studi problem gener semant annot frequent pattern goal discov hidden mean frequent pattern annot depth concis structur inform propos gener approach gener annot frequent pattern construct context model select inform context indic extract repres transact semant similar pattern gener approach incorpor user prior knowledg potenti applic gener dictionari descript pattern find synonym pattern discov semant relat summar semant class set frequent pattern experi top ddown mine interest pattern high dimension data dcube effici comput close cube aggreg dbase check recogn data cube produc huge output popular effort devot problem iceberg cube signific cell close cube group cell preserv roll drill semant losslessli compress cell due usabl import effici comput close cube warrant studi paper propos measur call closed effici close data cube show closed algebra measur comput effici increment base closed measur develop aggreg base approach call cube close cube integr success iceberg cube algorithm mm cube star cube perform studi show cube run order magnitud faster previou approach studi perform altern algorithm cube vari properti data set gener semant annot frequent pattern context analysi fundament data mine task frequent pattern mine widespread applic domain research frequent pattern mine focus develop effici algorithm discov kind frequent pattern attent paid import step interpret discov frequent pattern recent work studi compress summar frequent pattern propos techniqu annot frequent pattern semant inform support limit user understand pattern paper propos problem gener semant annot frequent pattern goal annot frequent pattern depth concis structur inform hidden mean pattern propos gener approach gener annot frequent pattern construct context model select inform context indic extract repres transact semant similar pattern gener approach potenti applic gener dictionarylik descript pattern find synonym pattern discov semant relat summar semant class set frequent pattern experi dataset show approach effect gener semant pattern annot extract redund dawar top dk pattern mine interest pattern high dimension data top ddown row enumer approach rank object base relationship text corpora enhanc addit metadata relat real world entiti document entiti discuss relationship typic obtain wide inform extract tool time interest associ typic hold entiti instanc corpu discuss hotel citi airlin fix associ entiti includ airlin oper flight citi hotel locat citi plethora applic necessit identif entiti match set keyword sampl queri find holidai packag pet friendli hotel locat histor live citi travel oper econom safe airlin keyword occur textual descript entiti actual hotel citi airlin answer queri exploit relationship entiti document keyword pet friendli occur document entiti hotel associ entiti hotel locat citi work focu class entiti packag finder queri outlin demonstr exist techniqu effici adapt solv problem result algorithm reli estim excess runtim storag overhead propos effici algorithm process queri larg corpora devis earli prune termin strategi presenc join aggreg execut entiti extract text depend estim analysi experiment evalu real synthet data demonstr effici scalabl approach robust index rank queri research interest gener interest data mine data wareh databas system current research focus model manag analyz larg scale graph inform network data answer top dk queri multi ddimension select rank cube approach observ real applic top queri consist compon reflect user prefer select condit rank function user propos ad hoc rank function interest subset data case user studi data initi multi dimension analysi top queri result previou work top queri process focus optim data access rank function problem effici answer top queri multidimension select address paper propos comput model call rank cube effici answer top queri multidimension select defin rank awar measur cube captur goal respond multidimension rank analysi base rank cube effici queri algorithm develop progress retriev data block top result found curs dimension challeng data cube cope difficulti introduc techniqu rank fragment experi microsoft sql server show propos approach signific improv previou method answer top dk queri multi ddimension select rank cube approach observ real applic top queri consist compon reflect user prefer select condit rank function user propos ad hoc rank function interest subset data case user studi data initi multi dimension analysi top queri result previou work top queri process focus optim data access rank function problem effici answer top queri multidimension select address paper propos comput model call rank cube effici answer top queri multidimension select defin rank awar measur cube captur goal respond multidimension rank analysi base rank cube effici queri algorithm develop progress retriev data block top result found curs dimension challeng data cube cope difficulti introduc techniqu rank fragment experi microsoft sql server show propos approach signific improv previou method mine evolv custom dproduct relationship multi ddimension space previou work mine transact databas focus primarili mine frequent itemset associ rule sequenti pattern interest relationship custom item evolut time studi paper propos gaussin transform base regress model captur time variant relationship custom product interest discov relationship multi dimension space effici method develop comput multi dimension aggreg curv data cube environ experiment result demonstr promis approach summar itemset pattern profil dbase approach frequent pattern mine studi extens scalabl method mine kind pattern includ itemset sequenc graph bottleneck frequent pattern mine effici interpret due huge number pattern gener mine process paper examin summar collect itemset pattern repres small number pattern user handl easili repres cover frequent pattern approxim support gener model built extract profil repres support pattern easili recov consult origin dataset base restor error propos qualiti measur function determin optim paramet polynomi time algorithm develop optim heurist effici improv empir studi obtain compact summar real dataset mine compress frequent dpattern set major challeng frequent pattern mine sheer size mine result case high min threshold discov commonsens pattern low gener explos number output pattern sever restrict usag paper studi problem compress frequent pattern set typic frequent pattern cluster tight measur call cluster repres pattern select cluster find minimum set repres pattern np hard develop greedi method rpglobal rplocal guarante compress bound higher comput complex sacrific theoret bound effici perform studi show compress qualiti rplocal close rpglobal reduc number close frequent pattern order magnitud rplocal mine faster fpclose fast close frequentpattern mine method show rpglobal rplocal combin balanc qualiti effici optim bound tempor flexibl plan dynam control mm dcube comput iceberg cube factor lattic space data cube iceberg cube comput problem studi research major approach develop direct top comput repres multiwai arrai aggreg util share comput perform dens data set bottom comput repres buc take advantag apriori prune perform spars data set integr top bottom comput repres starcub take advantag high perform case perform star cube degrad spars data set due addit cost introduc tree structur approach achiev uniformli high perform kind data set star dcube comput iceberg cube top ddown bottom dup integr data cube comput essenti expens oper data wareh previou studi developedtwo major approach top bottomup repres multiwai arrai cube call multiwai algorithm aggreg simultan multipledimens 